On Subtyping of Tree-Structured Data: A Polynomial Approach
نویسندگان
چکیده
This paper discusses subtyping of tree-structured data encountered on the Web, e.g. XML and HTML data. Our long range objective is to define a type system for Web and/or Semantic Web query languages amenable to static type checking. We propose a type formalism motivated by XML Schema and accommodating two concepts of subtyping: inclusion subtyping (corresponding to XML Schema notion of type restriction) and extension subtyping (motivated by XML Schema’s type extension). We present algorithms for checking both kinds of subtyping. The algorithms are polynomial if certain conditions are imposed on the type definitions; the conditions seem natural and not too restrictive.
منابع مشابه
Relaxation and Hybrid Approaches for Eecient Polynomial Basis Computation on Distributed Memory Machines
Two new approaches to eeciently compute an important polynomial basis (Grr obner basis) on distributed memory machines are presented. The rst approach is based on relaxation of dependencies present in the sequential computation. For the relaxation approach, speculative parallelism is achieved. In the hybrid approach, a Grr obner basis of a set of polynomials is computed in a tree-structured fas...
متن کاملSubtyping for F-Bounded Quantifiers and Equirecursive Types
This paper defines a notion of binding trees that provide a suitable model for second-order type systems with F-bounded quantifiers and equirecursive types. It defines a notion of regular binding trees that correspond in the right way to notions of regularity in the first-order case. It defines a notion of subtyping on these trees and proves various properties of the subtyping relation. It defi...
متن کاملEfficient Learning of Ordered Tree Patterns with Internal Structured Variables
We show that some foundamental classes of ordered tree pattern languages are polynomial time inductively inferable from positive data and exactly learnable in polynomial time using queries. We report experimental results on applying our learnining method to a collection of tree structured data.
متن کاملA Mixed Integer Programming Approach to Optimal Feeder Routing for Tree-Based Distribution System: A Case Study
A genetic algorithm is proposed to optimize a tree-structured power distribution network considering optimal cable sizing. For minimizing the total cost of the network, a mixed-integer programming model is presented determining the optimal sizes of cables with minimized location-allocation cost. For designing the distribution lines in a power network, the primary factors must be considered as m...
متن کاملOPTIMIZATION OF TREE-STRUCTURED GAS DISTRIBUTION NETWORK USING ANT COLONY OPTIMIZATION: A CASE STUDY
An Ant Colony Optimization (ACO) algorithm is proposed for optimal tree-structured natural gas distribution network. Design of pipelines, facilities, and equipment systems are necessary tasks to configure an optimal natural gas network. A mixed integer programming model is formulated to minimize the total cost in the network. The aim is to optimize pipe diameter sizes so that the location-alloc...
متن کامل